NANOPACK: Parallel codes for semiempirical quantum chemical calculations of large systems in the sp‐ and spd‐basis

A parallel implementation of the conventionally used NDDO (MNDO, AM1, PM3, CLUSTER‐Z1) and modified NDDO‐WF (CLUSTER‐Z2) techniques for semiempirical quantum chemical calculations of large molecular systems in the sp‐ and spd‐basis, respectively, is described. The atom‐pair distribution of data over processors forms the basis of the parallelization. The technological aspects of designing scalable parallel calculations on supercomputers (using ScaLAPACK and MPI libraries) are discussed. The scaling of individual algorithms and the entire package was carried out for model systems with 894, 1920, and 2014 atomic orbitals. The package speed‐up provided by different multiprocessor systems involving a cluster of Intel PIII processors, Alpha‐21264‐processor‐built machine MBC‐1000M, and Cray‐T3E is analyzed. The effect of computer characteristics on the package performance is discussed. © 2002 Wiley Periodicals, Inc. Int J Quantum Chem, 2002     

Genetic optimization of 5G-NR LDPC codes for lowering the error floor of BICM systems

With the wide range of commercial uses of fifth generation (5G), new radio (NR) communication networks, the wireless transmission becomes more efficient, reliable and faster. At the same time, high-quality signal transmission for 5G networks and beyond has also encountered new opportunities and challenges. Channel coding is a key technology to ensure reliable information transmission and service quality. However, the 5G-NR LDPC coded bit-interleaved coded modulation (BICM) sometimes suffers from relatively high error floors, so it can not always guarantee the high-quality and low-delay wireless transmission. In this paper, we propose a further redesign of the 5G-NR LDPC coded BICM based on genetic algorithm (GenAlg). By adjusting the number of the non-zero elements, the corresponding positions and shifting values in base matrix, we optimize the 5G-NR LDPC codes with GenAlg according to the error performances of coded BICM schemes. Simulation results show that the optimized 5G-NR LDPC codes which still support length and rate compatible coding have lower error floors with a little performance loss int the waterfall region compared to the standard 5G-NR LDPC codes with different modulation orders.     

Stabilizer quantum codes defined by trace-depending polynomials

Quantum error-correcting codes with good parameters can be constructed by evaluating polynomials at the roots of the polynomial trace [18]. In this paper, we propose to evaluate polynomials at the roots of trace-depending polynomials (given by a constant plus the trace of a polynomial) and show that this procedure gives rise to stabilizer quantum error-correcting codes with a wider range of lengths than in [18] and with excellent parameters. Namely, we are able to provide new binary records according to [21] and non-binary codes improving the ones available in the literature.     

针对X-Z型Pauli信道的量子稀疏图码的反馈式和积译码算法

本文针对X-Z型Pauli量子信道构建了一个量子稀疏图码的反馈式和积译码算法.相比较之前的基本和积算法,该反馈式译码策略利用了错误图样的比较, 稳定子中相关元素的值,特别的还根据信道的特征充分考虑了各变量所占错误的比重,并由此来调整信息节点的概率分布.该反馈式策略起到了经典译码中的软判决技术的作用,不但克服了对称简并问题带来的不利影响,更重要的是还给译码器提供了更多的有效信息,从而大大提高了译码器的纠错译码能力.另外,反馈式译码和积译码算法是基于GF(4)的,大大拓展了和积译码器关于量子译码 关键词： 量子稀疏图码 和积算法 量子纠错码 量子信息     

量子Turbo乘积码

量子通信是经典通信和量子力学相结合的一门新兴交叉学科.量子纠错编码是实现量子通信的关键技术之一.构造量子纠错编码的主要方法是借鉴经典纠错编码技术,许多经典的编码技术在量子领域中都可以找到其对应的编码方法.针对经典纠错码中最好码之一的Turbo乘积码,提出一种以新构造的CSS型量子卷积码为稳定子码的量子Turbo乘积码.首先,运用群的理论及稳定子码的基本原理构造出新的CSS型量子卷积码稳定子码生成元,并描述了其编码网络.接着,利用量子置换SWAP门定义推导出量子Turbo乘积码的交织编码矩阵.最后,推导出量子Turbo乘积码的译码迹距离与经典Turbo乘积码的译码距离的对应关系,并提出量子Turbo乘积码的编译码实现方案.这种编译码方法具有高度结构化,设计思路简单,网络易于实施的特点. 关键词： CSS码 量子卷积码 量子Turbo乘积码 量子纠错编码     

Linearized decomposition codes and finite integer set coverings

In this paper, we study parallel erasure correction (PEC) matrix codes capable of correcting multiple row erasures simultaneously. Our PEC codes are based on linearized decomposition (LD) of polynomials and we show that the LD codes are capable of row erasure correction using small locality sets, even if roughly half the rows are erased. We also study coverings of finite set of integers using predetermined neighbourhoods and use the covering estimate obtained, to bound the rate of LD codes.     

基于文本检索技术的CBIR算法研究

为了有效地利用成熟的文本检索技术,提出了一种新的图像检索算法.根据人眼的视觉特性,借鉴方块编码的思想将图像分成互不重叠的子图像块,这些子图像块在很大程度上体现了原始图像中的边缘及纹理信息,对这些子图像块进行定义,从而构造对表征图像内容有意义的图像子特征;在此基础上,把图像动态映射成文本描述形式,然后以所映射的文本为关键字,利用成熟的文本检索技术来实现图像检索.该算法不仅充分利用了图像的内容信息,而且有效地引入了文本检索技术,实验结果表明该算法具有较高的检索效率.     

A new family of two-dimensional codes for optical CDMA systems

The design of a new family of two-dimensional single pulse per column codes for optical code division multiple access (OCDMA) networks is reported. The 1-D modified pseudo-noise codes have been known to be orthogonal and their generation and system design based on these codes is rather simple. But their performance is limited due to the bandwidth constraints if the code length increases. Hence, using these 1-D modified pseudo-noise codes, modified 2-D pseudo-noise matrix codes (MPMCs) are generated. The system performance is evaluated for two, three and four simultaneous users using the link with all the sources responsible for degradation included: attenuation, chromatic dispersion, non-linear refractive effects, non-linear scattering and four-wave mixing. The effect of the non-linear and lossy dispersive medium over the system performance is shown by plotting the BER with respect to the link length for the systems designed using encoders/decoders base on 1-D modified pseudo-noise codes and our MPMCs. The performance is compared for the two types of codes by finding the crosstalk due to interfering users simultaneously operating in the network.     

量子卷积码的编译码方法

对于量子卷积码理论的研究旨在保护长距离通信中的量子信息序列. 定义了量子态的多项式表示形式,根据Calderbank-Shor-Steane(CSS)型量子码的构造方法,给出了CSS型量子卷积码的一种新的编译码方法,描述了编译码网络. 该方法将码字基态变换为信息多项式与生成多项式的乘积,然后用量子态上的多项式乘法操作实现编译码网络. 最后借鉴经典卷积码的译码思想,给出了具有线性复杂度的量子Viterbi算法. 关键词： 量子信息 量子卷积码 编译码 纠错算法     

The random energy model in a magnetic field and joint source-channel coding

We demonstrate that there is an intimate relationship between the magnetic properties of Derrida’s random energy model (REM) of spin glasses and the problem of joint source-channel coding in Information Theory. In particular, typical patterns of erroneously decoded messages in the coding problem have “magnetization” properties that are analogous to those of the REM in certain phases, where the non-uniformity of the distribution of the source in the coding problem plays the role of an external magnetic field applied to the REM. We also relate the ensemble performance (random coding exponents) of joint source-channel codes to the free energy of the REM in its different phases.